0.06/0.15	% Problem    : Vampire---4.8_30710 : TPTP v0.0.0. Released v0.0.0.
0.06/0.16	% Command    : run_E %s %d THM
0.16/0.37	% Computer : n001.cluster.edu
0.16/0.37	% Model    : x86_64 x86_64
0.16/0.37	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory   : 8042.1875MB
0.16/0.37	% OS       : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1440
0.16/0.37	% WCLimit    : 180
0.16/0.37	% DateTime   : Mon Jul  3 13:41:00 EDT 2023
0.16/0.37	% CPUTime    : 
0.23/0.53	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710
0.23/0.53	# Version: 3.1pre001-ho
2.15/0.83	# Preprocessing class: HSLMSMSSLLLCHSA.
2.15/0.83	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
2.15/0.83	# Starting lpo1_fix with 540s (3) cores
2.15/0.83	# Starting full_lambda_9 with 180s (1) cores
2.15/0.83	# Starting almost_fo_4 with 180s (1) cores
2.15/0.83	# Starting new_ho_9 with 180s (1) cores
2.15/0.83	# Starting pre_casc_4 with 180s (1) cores
2.15/0.83	# Starting ho_unfolding_6 with 180s (1) cores
2.15/0.83	# lpo1_fix with pid 30889 completed with status 0
2.15/0.83	# Result found by lpo1_fix
2.15/0.83	# Preprocessing class: HSLMSMSSLLLCHSA.
2.15/0.83	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
2.15/0.83	# Starting lpo1_fix with 540s (3) cores
2.15/0.83	# No SInE strategy applied
2.15/0.83	# Search class: HGHSM-FSLM32-MHSMMSBN
2.15/0.83	# Scheduled 11 strats onto 3 cores with 540 seconds (540 total)
2.15/0.83	# Starting full_lambda_5 with 50s (1) cores
2.15/0.83	# Starting new_ho_6 with 50s (1) cores
2.15/0.83	# Starting pre_casc_4 with 50s (1) cores
2.15/0.83	# new_ho_6 with pid 30899 completed with status 0
2.15/0.83	# Result found by new_ho_6
2.15/0.83	# Preprocessing class: HSLMSMSSLLLCHSA.
2.15/0.83	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
2.15/0.83	# Starting lpo1_fix with 540s (3) cores
2.15/0.83	# No SInE strategy applied
2.15/0.83	# Search class: HGHSM-FSLM32-MHSMMSBN
2.15/0.83	# Scheduled 11 strats onto 3 cores with 540 seconds (540 total)
2.15/0.83	# Starting full_lambda_5 with 50s (1) cores
2.15/0.83	# Starting new_ho_6 with 50s (1) cores
2.15/0.83	# Preprocessing time       : 0.010 s
2.15/0.83	
2.15/0.83	# Proof found!
2.15/0.83	# SZS status Theorem
2.15/0.83	# SZS output start CNFRefutation
2.15/0.83	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
2.15/0.83	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
2.15/0.83	thf(decl_25, type, in: $i > $i > $o).
2.15/0.83	thf(decl_61, type, imp: $o > $o > $o).
2.15/0.83	thf(decl_62, type, d_not: $o > $o).
2.15/0.83	thf(decl_71, type, non: $i > ($i > $o) > $i > $o).
2.15/0.83	thf(decl_72, type, l_some: $i > ($i > $o) > $o).
2.15/0.83	thf(decl_77, type, e_is: $i > $i > $i > $o).
2.15/0.83	thf(decl_123, type, nat: $i).
2.15/0.83	thf(decl_124, type, n_is: $i > $i > $o).
2.15/0.83	thf(decl_127, type, n_some: ($i > $o) > $o).
2.15/0.83	thf(decl_142, type, n_pl: $i > $i > $i).
2.15/0.83	thf(decl_147, type, diffprop: $i > $i > $i > $o).
2.15/0.83	thf(decl_148, type, d_29_ii: $i > $i > $o).
2.15/0.83	thf(decl_200, type, esk40_0: $i).
2.15/0.83	thf(decl_201, type, esk41_0: $i).
2.15/0.83	thf(decl_202, type, esk42_0: $i).
2.15/0.83	thf(decl_203, type, esk43_0: $i).
2.15/0.83	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_d_not)).
2.15/0.83	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_imp)).
2.15/0.83	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_all_of)).
2.15/0.83	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_is_of)).
2.15/0.83	thf(def_non, axiom, ((non)=(^[X1:$i, X2:$i > $o, X4:$i]:((d_not @ ((X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_non)).
2.15/0.83	thf(def_l_some, axiom, ((l_some)=(^[X1:$i, X2:$i > $o]:((d_not @ ((all_of @ (^[X4:$i]:((in @ X4 @ X1))) @ (non @ X1 @ X2))))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_l_some)).
2.15/0.83	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_e_is)).
2.15/0.83	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_diffprop)).
2.15/0.83	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_n_is)).
2.15/0.83	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_d_29_ii)).
2.15/0.83	thf(def_n_some, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X441:$i]:(((((in @ X441 @ nat)))=>((((((Z0 @ X441)))=>(~($true))))))))))=>(~($true))))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', def_n_some)).
2.15/0.83	thf(satz19a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X217:$i]:((in @ X217 @ nat))) @ (^[X218:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((d_29_ii @ X1 @ X218)=>(d_29_ii @ (n_pl @ X1 @ X4) @ (n_pl @ X218 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', satz19a)).
2.15/0.83	thf(satz5, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X253:$i]:((in @ X253 @ nat))) @ (^[X254:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((n_is @ (n_pl @ (n_pl @ X1 @ X254) @ X4) @ (n_pl @ X1 @ (n_pl @ X254 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', satz5)).
2.15/0.83	thf(satz6, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X261:$i]:((in @ X261 @ nat))) @ (^[X262:$i]:((n_is @ (n_pl @ X1 @ X262) @ (n_pl @ X262 @ X1)))))))), file('/export/starexec/sandbox/tmp/tmp.uoLQlV1xNp/Vampire---4.8_30710', satz6)).
2.15/0.83	thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
2.15/0.83	thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
2.15/0.83	thf(c_0_16, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
2.15/0.83	thf(c_0_17, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
2.15/0.83	thf(c_0_18, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_non])).
2.15/0.83	thf(c_0_19, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])).
2.15/0.83	thf(c_0_20, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X414:$i]:(((((in @ X414 @ Z0)))=>((((((Z1 @ X414)))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_l_some])).
2.15/0.83	thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])).
2.15/0.83	thf(c_0_22, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_19])).
2.15/0.83	thf(c_0_23, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
2.15/0.83	thf(c_0_24, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X414:$i]:(((((in @ X414 @ Z0)))=>((((((Z1 @ X414)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_19]), c_0_22])).
2.15/0.83	thf(c_0_25, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
2.15/0.83	thf(c_0_26, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_23])).
2.15/0.83	thf(c_0_27, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X452:$i]:(((((in @ X452 @ nat)))=>(((((((((Z0)=(n_pl @ Z1 @ X452))))))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
2.15/0.83	thf(c_0_28, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X441:$i]:(((((in @ X441 @ nat)))=>((((((Z0 @ X441)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[def_n_some, c_0_24])).
2.15/0.83	thf(c_0_29, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_25, c_0_26])).
2.15/0.83	thf(c_0_30, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X452:$i]:(((((in @ X452 @ nat)))=>(((((((((Z0)=(n_pl @ Z1 @ X452))))))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27, c_0_28]), c_0_29])).
2.15/0.83	thf(c_0_31, negated_conjecture, ~(![X607:$i]:(((in @ X607 @ nat)=>![X606:$i]:(((in @ X606 @ nat)=>![X605:$i]:(((in @ X605 @ nat)=>(~(![X603:$i]:(((in @ X603 @ nat)=>((X607)!=(n_pl @ X606 @ X603)))))=>~(![X604:$i]:(((in @ X604 @ nat)=>((n_pl @ X607 @ X605)!=(n_pl @ (n_pl @ X606 @ X605) @ X604))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19a])]), c_0_21]), c_0_30])])).
2.15/0.83	thf(c_0_32, plain, ![X683:$i]:(((in @ X683 @ nat)=>![X682:$i]:(((in @ X682 @ nat)=>![X681:$i]:(((in @ X681 @ nat)=>((n_pl @ (n_pl @ X683 @ X682) @ X681)=(n_pl @ X683 @ (n_pl @ X682 @ X681))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]), c_0_21]), c_0_26])).
2.15/0.83	thf(c_0_33, negated_conjecture, ![X1219:$i]:(((in @ esk40_0 @ nat)&((in @ esk41_0 @ nat)&((in @ esk42_0 @ nat)&(((in @ esk43_0 @ nat)&((esk40_0)=(n_pl @ esk41_0 @ esk43_0)))&(~(in @ X1219 @ nat)|((n_pl @ esk40_0 @ esk42_0)!=(n_pl @ (n_pl @ esk41_0 @ esk42_0) @ X1219)))))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])).
2.15/0.83	thf(c_0_34, plain, ![X1289:$i, X1290:$i, X1291:$i]:((~(in @ X1289 @ nat)|(~(in @ X1290 @ nat)|(~(in @ X1291 @ nat)|((n_pl @ (n_pl @ X1289 @ X1290) @ X1291)=(n_pl @ X1289 @ (n_pl @ X1290 @ X1291))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])).
2.15/0.83	thf(c_0_35, plain, ![X697:$i]:(((in @ X697 @ nat)=>![X696:$i]:(((in @ X696 @ nat)=>((n_pl @ X697 @ X696)=(n_pl @ X696 @ X697)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]), c_0_21]), c_0_26])).
2.15/0.83	thf(c_0_36, negated_conjecture, ![X1:$i]:((~((in @ X1 @ nat))|((n_pl @ esk40_0 @ esk42_0)!=(n_pl @ (n_pl @ esk41_0 @ esk42_0) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_33])).
2.15/0.83	thf(c_0_37, plain, ![X1:$i, X4:$i, X5:$i]:((((n_pl @ (n_pl @ X1 @ X4) @ X5)=(n_pl @ X1 @ (n_pl @ X4 @ X5)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_34])).
2.15/0.83	thf(c_0_38, negated_conjecture, (in @ esk42_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_33])).
2.15/0.83	thf(c_0_39, negated_conjecture, (in @ esk41_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_33])).
2.15/0.83	thf(c_0_40, plain, ![X1304:$i, X1305:$i]:((~(in @ X1304 @ nat)|(~(in @ X1305 @ nat)|((n_pl @ X1304 @ X1305)=(n_pl @ X1305 @ X1304))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])).
2.15/0.83	thf(c_0_41, negated_conjecture, ![X1:$i]:((((n_pl @ esk41_0 @ (n_pl @ esk42_0 @ X1))!=(n_pl @ esk40_0 @ esk42_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38]), c_0_39])])).
2.15/0.83	thf(c_0_42, plain, ![X1:$i, X4:$i]:((((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_40])).
2.15/0.83	thf(c_0_43, negated_conjecture, ((esk40_0)=(n_pl @ esk41_0 @ esk43_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
2.15/0.83	thf(c_0_44, negated_conjecture, (in @ esk43_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_33])).
2.15/0.83	thf(c_0_45, negated_conjecture, ![X1:$i]:((((n_pl @ esk41_0 @ (n_pl @ X1 @ esk42_0))!=(n_pl @ esk40_0 @ esk42_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_38])])).
2.15/0.83	thf(c_0_46, negated_conjecture, ![X1:$i]:((((n_pl @ esk41_0 @ (n_pl @ esk43_0 @ X1))=(n_pl @ esk40_0 @ X1))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_43]), c_0_44]), c_0_39])])).
2.15/0.83	thf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_44]), c_0_38])]), ['proof']).
2.15/0.83	# SZS output end CNFRefutation
2.15/0.83	# Parsed axioms                        : 369
2.15/0.83	# Removed by relevancy pruning/SinE    : 0
2.15/0.83	# Initial clauses                      : 543
2.15/0.83	# Removed in clause preprocessing      : 158
2.15/0.83	# Initial clauses in saturation        : 385
2.15/0.83	# Processed clauses                    : 1508
2.15/0.83	# ...of these trivial                  : 66
2.15/0.83	# ...subsumed                          : 567
2.15/0.83	# ...remaining for further processing  : 875
2.15/0.83	# Other redundant clauses eliminated   : 283
2.15/0.83	# Clauses deleted for lack of memory   : 0
2.15/0.83	# Backward-subsumed                    : 23
2.15/0.83	# Backward-rewritten                   : 55
2.15/0.83	# Generated clauses                    : 11000
2.15/0.83	# ...of the previous two non-redundant : 10394
2.15/0.83	# ...aggressively subsumed             : 0
2.15/0.83	# Contextual simplify-reflections      : 8
2.15/0.83	# Paramodulations                      : 10643
2.15/0.83	# Factorizations                       : 2
2.15/0.83	# NegExts                              : 0
2.15/0.83	# Equation resolutions                 : 340
2.15/0.83	# Total rewrite steps                  : 2152
2.15/0.83	# Propositional unsat checks           : 1
2.15/0.83	#    Propositional check models        : 1
2.15/0.83	#    Propositional check unsatisfiable : 0
2.15/0.83	#    Propositional clauses             : 0
2.15/0.83	#    Propositional clauses after purity: 0
2.15/0.83	#    Propositional unsat core size     : 0
2.15/0.83	#    Propositional preprocessing time  : 0.000
2.15/0.83	#    Propositional encoding time       : 0.010
2.15/0.83	#    Propositional solver time         : 0.004
2.15/0.83	#    Success case prop preproc time    : 0.000
2.15/0.83	#    Success case prop encoding time   : 0.000
2.15/0.83	#    Success case prop solver time     : 0.000
2.15/0.83	# Current number of processed clauses  : 780
2.15/0.83	#    Positive orientable unit clauses  : 148
2.15/0.83	#    Positive unorientable unit clauses: 1
2.15/0.83	#    Negative unit clauses             : 44
2.15/0.83	#    Non-unit-clauses                  : 587
2.15/0.83	# Current number of unprocessed clauses: 9103
2.15/0.83	# ...number of literals in the above   : 34072
2.15/0.83	# Current number of archived formulas  : 0
2.15/0.83	# Current number of archived clauses   : 78
2.15/0.83	# Clause-clause subsumption calls (NU) : 93717
2.15/0.83	# Rec. Clause-clause subsumption calls : 45742
2.15/0.83	# Non-unit clause-clause subsumptions  : 330
2.15/0.83	# Unit Clause-clause subsumption calls : 6585
2.15/0.83	# Rewrite failures with RHS unbound    : 0
2.15/0.83	# BW rewrite match attempts            : 43
2.15/0.83	# BW rewrite match successes           : 14
2.15/0.83	# Condensation attempts                : 1508
2.15/0.83	# Condensation successes               : 3
2.15/0.83	# Termbank termtop insertions          : 296303
2.15/0.83	
2.15/0.83	# -------------------------------------------------
2.15/0.83	# User time                : 0.267 s
2.15/0.83	# System time              : 0.015 s
2.15/0.83	# Total time               : 0.282 s
2.15/0.83	# Maximum resident set size: 6492 pages
2.15/0.83	
2.15/0.83	# -------------------------------------------------
2.15/0.83	# User time                : 0.723 s
2.15/0.83	# System time              : 0.041 s
2.15/0.83	# Total time               : 0.763 s
2.15/0.83	# Maximum resident set size: 2284 pages
2.15/0.84	% E---3.1 exiting
2.15/0.84	EOF